Перевод: с английского на русский

с русского на английский

integer programming problem

См. также в других словарях:

  • Zero-One Integer Programming — An analytical method consisting of what amounts to a series of yes (1) and no (0) answers to arrive at a solution. In the world of finance, such programming is often used to provide answers to capital rationing problems, as well as to optimize… …   Investment dictionary

  • Zero-one integer programming — An analytical method that can be used to determine the solution to a capital rationing problem. The New York Times Financial Glossary …   Financial and business terms

  • zero-one integer programming — An analytical method that can be used to determine the solution to a capital rationing problem. Bloomberg Financial Dictionary …   Financial and business terms

  • Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… …   Wikipedia

  • Programming language — lists Alphabetical Categorical Chronological Generational A programming language is an artificial language designed to communicate instructions to a machine, particularly a computer. Programming languages can be used to create programs that… …   Wikipedia

  • Integer (Datentyp) — Mit Integer (ˈɪnteːɡɐ oder ˈɪntɪdʒə, englisch für ganze Zahl von lat. numerus integer) wird in der Informatik ein Datentyp bezeichnet, der ganzzahlige Werte speichert. Der Wertebereich ist endlich. Berechnungen mit Integern sind in der Regel… …   Deutsch Wikipedia

  • Problem der exakten Überdeckung — Das Problem der exakten Überdeckung (englisch Exact Cover) ist ein Entscheidungsproblem der Kombinatorik. Es gehört zu den 21 klassischen NP vollständigen Problemen, von denen Richard M. Karp 1972 gezeigt hat, dass sie NP vollständig sind.… …   Deutsch Wikipedia

  • Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

  • Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… …   Wikipedia

  • Semidefinite programming — (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space.Semidefinite programming is a relatively new field… …   Wikipedia

  • Cutting stock problem — The cutting stock problem is an optimization problem, or more specifically, an integer linear programming problem. It arises from many applications in industry. Imagine that you work in a paper mill and you have a number of rolls of paper of… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»